منابع مشابه
Random Trees in Random Graphs
We show that a random labeled n-vertex graph almost surely contains isomorphic copies of almost all labeled n-vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n increases, and the set of trees referred to as "almost all" depends on the random graph. In the other sense, the probability of an edge occurring is fixed, and the releva...
متن کاملTrees in random graphs
Let us consider the probability space Ifi(n, p) consisting of all graphs on n labeled vertices where each edge occurs with probability p =1q, independently of all other edges . The aim of this note is to find such natural numbers which are likely to occur as orders of maximal induced trees contained in a graph G E 19(n, p) when 0 < p < 1 is fixed . By a maximal induced tree we mean an induced t...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملEmbedding Spanning Trees in Random Graphs
We prove that if T is a tree on n vertices with maximum degree ∆ and the edge probability p(n) satisfies: np ≥ C max{∆ log n, n } for some constant > 0, then with high probability the random graph G(n, p) contains a copy of T . The obtained bound on the edge probability is shown to be essentially tight for ∆ = n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1988
ISSN: 0002-9939
DOI: 10.2307/2047572